An Efficient Successive Elimination Algorithm for Block-Matching Motion Estimation

نویسندگان

  • Hanan A. Mahmoud
  • Magdy A. Bayoumi
چکیده

Low power VLSI video compression processors are in high demand for the emerging wireless video applications [1]. Video compression processors include VLSI implementation of a motion estimation algorithm. Many motion estimation algorithms are found in the literature. Some of them are fast but can not guarantee an optimal solution; they can be stuck in a local optima. Such algorithms are fast, consumes less power when implemented in VLS, but they can result in high levels of distortion that cannot be accepted in many applications [1], [2], and [3]. On the other hand full search block matching algorithm (FSBM) is computationally intensive and a VLSI implementation of such algorithm has high power consumption [1], [4]. This paper presents an exhaustive search algorithm for block matching motion estimation. The proposed algorithm reduces the computational load with successive elimination of noncandidate blocks in the search window. Our proposed algorithm assigns each pixel to a category depending on its value. The number of categories is predetermined. The algorithm consists of number of stages, the first of which has the fewer categories, eliminating those search points that are the farthest from the match. The last stage is the FSBM but with fewer search points. This computational reduction leads to low-power VLSI implementation of the algorithm. Also, it leads to faster efficient motion estimation procedure. The correctness of this algorithm and its complexity are proved. ACKNOWLEDGMENTThe authors would like to acknowledge that this work was supported by US Departmentof Energy (DOE), EETAPP program REFERENCES[1] Viet L. Do and Kenneth Y. Yun " A Low-Power VLSI Architecture for Full-Search Block-Matching Motion Estimation," IEEE Trans. On Circuits and Systemfor Video Tech. Vol. 8, No. 4, pp. 393-398, Aug. 1998.[2] R. Li, B. Zeng, and M. L. Liou, "A New Three-step Search Algorithm for BlockMotion Estimation," IEEE Trans. Circuits Syst. Video Technol., vol. 4, pp. 438-442, Aug. 1994.[3] Wael M. Badawy, Guoqing Zhang and Magdy A. Bayoumi, "VLSI Architecture for Hierarchical Mesh-Based Motion Estimation", 1999 IEEE Workshop on SignalProcessing Systems (SIPS), Taipei, Taiwan, Oct. 20-22, 1999 [4] A. Tyagi and M. A. Bayoumi” Image Segmentation on a 2D Array by a Directed Split and Merge Procedure,” IEEE Trans. on Signal Processing, vol. 40, pp.2804-2813, May. 1992.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Successive Elimination Algorithm for Fast Optimal Block Matching Motion Estimation

In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up ...

متن کامل

Efficient tree structured motion estimation using successive elimination - Vision, Image and Signal Processing, IEE Proceedings-

In H.264/AVC, tree structured motion estimation enhances the coding efficiency significantly while dramatically increasing the computational complexity of block matching. In the paper, a successive elimination algorithm (SEA) is implemented in tree structured motion estimation with a simple and effective method to determine the initial motion vector, which exploits the strong correlation among ...

متن کامل

An Efficient Motion Multiple Reference F

The H.264/AVC coding standard allows more than one decoded frame reference frames to make full use of reducing temporal redundancy in a video sequence. However, motion estimation in multiple frames introduces tremendous computational complexity. This paper presents a fast full search motion estimation algorithm for multiple reference frame motion estimation. The proposed method can be applied t...

متن کامل

An improved multilevel successive elimination algorithm for fast full-search motion estimation

It is well known that a lot of computations are required for motion estimation in video encoding. Recently, the multilevel successive elimination algorithm (MSEA) has been proposed to reduce the computational complexity of block matching for motion estimation without degradation of estimation accuracy. In the MSEA, the block matching is hierarchically carried out and the invalid candidate block...

متن کامل

New adaptive interpolation schemes for efficient meshbased motion estimation

Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...

متن کامل

Advanced Multi-level Successive Elimination Algorithms Using the Locality of Pixels in Block

In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced Multi-level Successive Elimination Algorithms are based on the Multi-level Successive Elimination Algorithm. Advanced Multi-level Successive Elimination Algorithms consist of two algorithms. The first algorithm is that when we calculate the sum of abs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000